A GENERALIZED VERSION OF ONE MACHINE MAXIMUM LATENESS PROBLEM
نویسندگان
چکیده
منابع مشابه
Solving Single Machine Sequencing to Minimize Maximum Lateness Problem Using Mixed Integer Programming
Despite existing various integer programming for sequencing problems, there is not enoughinformation about practical values of the models. This paper considers the problem of minimizing maximumlateness with release dates and presents four different mixed integer programming (MIP) models to solve thisproblem. These models have been formulated for the classical single machine problem, namely sequ...
متن کاملPerformance Analysis of Six Approximation Algorithms for the One - Machine Maximum Lateness Scheduling Problem with Ready Times
Hiroshi Kise Kyoto Institute of Technology Toshihid,! Ibaraki ar.d Hisashi Mine Kyoto University (Received November 24,1978; Revised March 12, 1979) Six approximation algorithms for the one-machine scheduling problem with ready and due times to minimize the maximum lateness are analyzed. The performance is measured by the relative deviation of approximate values to optimal ones. Best possible u...
متن کاملA Hybrid Dual-Population Genetic Algorithm for the Single Machine Maximum Lateness Problem
We consider the problem of scheduling a number of jobs, each job having a release time, a processing time and a due date, on a single machine with the objective of minimizing the maximum lateness. We developed a hybrid dual-population genetic algorithm and compared its performance with alternative methods on a new diverse data set. Extensions from a single to a dual population by taking problem...
متن کاملsolving single machine sequencing to minimize maximum lateness problem using mixed integer programming
despite existing various integer programming for sequencing problems, there is not enoughinformation about practical values of the models. this paper considers the problem of minimizing maximumlateness with release dates and presents four different mixed integer programming (mip) models to solve thisproblem. these models have been formulated for the classical single machine problem, namely sequ...
متن کاملA new mathematical model for single machine batch scheduling problem for minimizing maximum lateness with deteriorating jobs
Article history: Received 10 March 2010 Received in revised form July, 25, 2011 Accepted 26 July 2011 Available online 27 July 2011 This paper presents a mathematical model for the problem of minimizing the maximum lateness on a single machine when the deteriorated jobs are delivered to each customer in various size batches. In reality, this issue may happen within a supply chain in which deliv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1989
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.32.383